SEMAGRAPH: the theory and practice of term graph rewriting
نویسنده
چکیده
Semagraph II is a working group (WG 6345) supported by the CEC basic research directorate. The main aim of Semagraph II has been to mature and promulgate the research results and prototypes developed during the Semagraph I Basic Research Action (BRA 3074). This note outlines the aims and achievements of Semagraph, and provides references to key results.
منابع مشابه
Term Graph Rewriting
O. Introduction. In this paper we will discuss in an informM way some aspects of t@rm graph rewriting. We will indicate why this subject falls in the scope of higher-order rewriting, and thus in the scope of the present workshop. Our discussion will be loosely structured by a numbered sequence of keywords and phrases, thereby following a talk given at the workshop. In the theory of rewriting, t...
متن کاملTerm Graph Rewriting and Strong Sequentiality
This paper propagates the use of term graph rewriting systems as a formal computational model. The deenition of both term graphs and the reduction relation on term graphs are more complex than their corresponding notions in term rewriting systems. Consequently, it is often believed that reasoning about term graph rewriting systems is inherently more diicult than reasoning about term rewriting s...
متن کاملTerm-Graph Rewriting Via Explicit Paths
The notion of path is classical in graph theory but not directly used in the term rewriting community. The main idea of this work is to raise the notion of path to the level of first-order terms, i.e. paths become part of the terms and not just meta-information about them. These paths are represented by words of integers (positive or negative) and are interpreted as relative addresses in terms....
متن کاملComputing with Terms and Graphs
Research in term and graph rewriting ranges from theoretical questions to practical issues. Computing with graphs handles the sharing of common subexpressions in a natural and seamless way, and improves the efficiency of computations in space and time. Sharing is ubiquitous in several research areas, as witnessed by the modelling of first-and higher-order term rewriting by (acyclic or cyclic) g...
متن کاملExtending Graph Rewriting with Copying
The notion of term graph rewrite system (TGRS) is extended with a lazy copying mechanism. By analyzing this mechanism, a connu-ence result is obtained for these so-called copy term graph rewrite systems (C-TGRS). Some ideas on the use of lazy copying in practice are presented .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 2 شماره
صفحات -
تاریخ انتشار 1995